Strong Memoryless times and Rare Events in Markov Renewal Point Processes
نویسنده
چکیده
Let W be the number of points in (0, t] of a stationary finitestate Markov renewal point process. We derive a bound for the total variation distance between the distribution of W and a compound Poisson distribution. For any nonnegative random variable ζ, we construct a “strong memoryless time” ζ̂ such that ζ − t is exponentially distributed conditional on {ζ̂ ≤ t, ζ > t}, for each t. This is used to embed the Markov renewal point process into another such process whose state space contains a frequently observed state which represents loss of memory in the original process. We then write W as the accumulated reward of an embedded renewal reward process, and use a compound Poisson approximation error bound for this quantity by Erhardsson. For a renewal process, the bound depends in a simple way on the first two moments of the interrenewal time distribution, and on two constants obtained from the Radon–Nikodym derivative of the interrenewal time distribution with respect to an exponential distribution. For a Poisson process, the bound is 0.
منابع مشابه
Extended Geometric Processes: Semiparametric Estimation and Application to ReliabilityImperfect repair, Markov renewal equation, replacement policy
Lam (2007) introduces a generalization of renewal processes named Geometric processes, where inter-arrival times are independent and identically distributed up to a multiplicative scale parameter, in a geometric fashion. We here envision a more general scaling, not necessar- ily geometric. The corresponding counting process is named Extended Geometric Process (EGP). Semiparametric estimates are...
متن کاملThe (True) Concurrent Markov Property and Some Applications to Markov Nets
We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of processes is defined on partial orders, not on firing sequences. We focus on memoryless probabilistic nets: we give a definition for such systems, that we call Markov nets, and we study their properties. We show that several tools...
متن کاملSemi Markov model for market microstructure
We introduce a new model for describing the fluctuations of a tick-by-tick single asset price. Our model is based on Markov renewal processes. We consider a point process associated to the timestamps of the price jumps, and marks associated to price increments. By modeling the marks with a suitable Markov chain, we can reproduce the strong mean-reversion of price returns known as microstructure...
متن کاملEE226a - Summary of Lecture 26 Renewal Processes
As the name indicates, a renewal process is one that “renews” itself regularly. That is, there is a sequence of times {Tn, n ∈ Z} such that the process after time Tn is independent of what happened before that time and has a distribution that does not depend on n. We have seen examples of such processes before. As a simple example, one could consider a Poisson process with jump times Tn. As ano...
متن کاملStrong Approximations
In real stochastic systems, the arrival and service processes may not be renewal processes. For example, in many telecommunication systems such as internet traffic where data traffic is bursty, the sequence of inter-arrival times and service times are often correlated and dependent. One way to model this non-renewal behavior is to use Markovian Arrival Processes (MAP’s) and Markovian Service Pr...
متن کامل